Cut-off for sandpiles on tiling graphs
نویسندگان
چکیده
Sandpile dynamics are considered on graphs constructed from periodic plane and space tilings by assigning a growing piece of the tiling, either torus or open boundary conditions. A general method obtaining Green’s function tiling is given, total variation cut-off phenomenon demonstrated under It shown that condition does not affect mixing time for planar tilings. In companion paper, computational methods used to demonstrate an alters D4 lattice in dimension 4, while asymptotic evaluation shows it change cubic Zd all sufficiently large d.
منابع مشابه
Cut-off for large sums of graphs
If L is the combinatorial Laplacian of a graph, exp(−L t) converges to a matrix with identical coefficients. The speed of convergence is measured by the maximal entropy distance. When the graph is the sum of a large number of components, a cut-off phenomenon may occur: before some instant the distance to equilibrium tends to infinity; after that instant it tends to 0. A sufficient condition for...
متن کاملCut-off Grade Optimization for Maximizing the Output Rate
In the open-pit mining, one of the first decisions that must be made in production planning stage, after completing the design of final pit limits, is determining of the processing plant cut-off grade. Since this grade has an essential effect on operations, choosing the optimum cut-off grade is of considerable importance. Different goals may be used for determining optimum cut-off grade. One of...
متن کاملFlow-cut Dualities for Sheaves on Graphs
This paper generalizes the Max-Flow Min-Cut (MFMC) theorem from the setting of numerical capacities to cellular sheaves of semimodules on directed graphs. Motivating examples of semimodules include probability distributions, multicommodity capacity constraints, and logical propositions. Directed algebraic topology provides the tools necessary for capturing the salient information in such a gene...
متن کاملCut locus structures on graphs
Motivated by a fundamental geometrical object, the cut locus, we introduce and study a new combinatorial structure on graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Probability
سال: 2021
ISSN: ['0091-1798', '2168-894X']
DOI: https://doi.org/10.1214/20-aop1458